Characterization of Tantrix Curves

نویسنده

  • RALPH HOWARD
چکیده

Let S1 be the unit circle realized as R/Z. Then a regular closed curve in Rn is a smooth mapping c : S1 → Rn so that the velocity vector c′(t) never vanishes. The tantrix of such a curve is the map t : S1 → Sn−1 given by t(t) = c′(t)/‖c′(t)‖, that is the unit tangent to c parallel translated to the origin. Our goal is to understand which curves t : S1 → Sn−1 can be realized as the tantrix to a regular closed curve. A first step is the following, due to Löwner, is a necessary condition for a curve to be a tantrix. This is attributed to Löwner by both Fenchel [1, p. 39] and Pólya and Szegő [2, Band II S. 165 und 391 Aufgabe, 13.]. I have not been able to track down the original paper of Löwner. Theorem 1.1 (Löwner). If a curve t : S1 → Sn−1 is a tantrix then the origin is in the convex hull of the image of t. This implies that every totally geodesic Sn−2 in Sn−1 meets t in at least one point.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Three-Color and Two-Color Tantrix Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions

Holzer and Holzer [HH04] proved the Tantrix rotation puzzle problem with four colors NP-complete. Baumeister and Rothe [BR07] modified their construction to achieve a parsimonious reduction from satisfiability to this problem. Since parsimonious reductions preserve the number of solutions, it follows that the unique version of the four-color Tantrix rotation puzzle problem is DP-complete under ...

متن کامل

Nonexistence of Skew Loops on Ellipsoids

We prove that every C closed curve immersed on an ellipsoid has a pair of parallel tangent lines. This establishes the optimal regularity for a phenomenon first observed by B. Segre. Our proof uses an approximation argument with the aid of an estimate for the size of loops in the tangential spherical image of a spherical curve. A skew loop is a C closed curve without parallel tangent lines imme...

متن کامل

An Integer Programming Approach to Solving Tantrix on Fixed Boards

Tantrix (Tantrix R ⃝ is a registered trademark of Colour of Strategy Ltd. in New Zealand, and of TANTRIX JAPAN in Japan, respectively, under the license of M. McManaway, the inventor.) is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we first give a problem setting of solving Tantrix as ma...

متن کامل

Solving Tantrix via Integer Programming

Tantrix is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we give a problem setting of solving Tantrix as arranging tiles in an appropriate shape and making a loop at the same time within a given hexagonal lattice board. We then formulate it as an integer program by expressing the rules of ...

متن کامل

Monte-Carlo Tree Search: Applied to Domineering and Tantrix

................................................................................................................................................... i Chapter 1: Introduction ........................................................................................................................... 1 The Rules of Tantrix ...............................................................................

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999